Intersecting Families of Finite Sets and Fixed-point-Free 2-Elements

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Intersecting Families of Finite Sets and Fixed-point-Free 2-Elements

We study the maximum cardinality of a pairwise-intersecting family of subsets of an n-set, or the size of the smallest set in such a family, under either of the assumptions that it is regular (as a hypergraph) or that it admits a transitive permutation group. Not surprisingly, results under the second assumption are stronger. We also give some results for 4-wise intersecting families under the ...

متن کامل

Maximal Intersecting Families of Finite Sets and «uniform Hjelmslev Planes

The following theorem is proved. The collection of lines of an n-uniform projective Hjelmslev plane is maximal when considered as a collectiion of mutually intersecting sets of equal cardinality.

متن کامل

Intersecting families of sets, no l containing two common elements

Let H denote the set {f1, f2, ..., fn}, 2 the collection of all subsets of H and F ⊆ 2 be a family. The maximum of |F| is studied if any k subsets have a non-empty intersection and the intersection of any l distinct subsets (1 ≤ k < l) is empty. This problem is reduced to a covering problem. If we have the conditions that any two subsets have a non-empty intersection and the intersection of any...

متن کامل

Multiply intersecting families of sets

Let [n] denote the set {1, 2, ..., n}, 2 the collection of all subsets of [n] and F ⊂ 2 be a family. The maximum of |F| is studied if any r subsets have an at least s-element intersection and there are no ` subsets containing t+1 common elements. We show that |F| ≤ Pt−s i=0 n−s i + t+`−s t+2−s n−s t+1−s + `− 2 and this bound is asymptotically the best possible as n →∞ and t ≥ 2s ≥ 2, r, ` ≥ 2 a...

متن کامل

Intersecting Balanced Families of Sets

Suppose that any t members (t ≥ 2) of a regular family on an n element set have at least k common elements. It is proved that the largest member of the family has at least k1/tn1−1/t elements. The same holds for balanced families, which is a generalization of the regularity. The estimate is asymptotically sharp.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: European Journal of Combinatorics

سال: 1989

ISSN: 0195-6698

DOI: 10.1016/s0195-6698(89)80042-3